Multicolor urn models with reducible replacement matrices
نویسندگان
چکیده
منابع مشابه
Multicolor urn models with reducible replacement matrices
Consider the multicolored urn model where after every draw, balls of the different colors are added to the urn in proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three and four color urns, we derive the asymptotic behavior of linear combinations of number of balls. In particular, we show that certain li...
متن کاملStrong convergence for urn models with reducible replacement policy
A multitype urn scheme with random replacements is considered. Each time a ball is picked, another ball is added, and its type is chosen according to the transition probabilities of a reducible Markov chain. The vector of frequencies is shown to converge almost surely to a random element of the set of stationary measures of the Markov chain. Its probability distribution is characterized as the ...
متن کاملar X iv : 0 71 0 . 15 20 v 1 [ m at h . PR ] 8 O ct 2 00 7 MULTICOLOR URN MODELS WITH REDUCIBLE REPLACEMENT MATRICES
Consider the multicolored urn model where after every draw, balls of the different colors are added to the urn in proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three and four color urns, we derive the asymptotic behavior of linear combinations of number of balls. In particular, we show that certain li...
متن کاملPólya Urn Models under General Replacement Schemes
In this paper, we consider a Pólya urn model containing balls of m different labels under a general replacement scheme, which is characterized by an m×m addition matrix of integers without constraints on the values of these m integers other than non-negativity. This urn model includes some important urn models treated before. By a method based on the probability generating functions, we conside...
متن کاملCollision Times in Multicolor Urn Models and Sequential Graph Coloring With Applications to Discrete Logarithms
Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball. Collisions occur when a ball is placed in an urn which already contains a ball of different color. Equivalently, this can be viewed as sequentially coloring a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2009
ISSN: 1350-7265
DOI: 10.3150/08-bej150